A note on the Martin-Löf test for unidimensionality
نویسندگان
چکیده
One test which is often used to investigate fit of the Rasch model to a dataset, is the Martin-Löf test for unidimensionality. This paper investigates whether (and when) its asymptotic chi-square distribution can be assumed to be appropriate. We also study the power of this test.
منابع مشابه
Strategies for interactive proof and program development in Martin-Löf Type Theory
We propose some strategies for automatic tools facilitating interactive proof and program development in the proof editor Alfa based on Martin-Löf Type Theory.
متن کاملSome tools for computer-assisted theorem proving in Martin-Löf type theory
We propose some tools facilitating interactive proof and program development in the proof editor Alfa based on Martin-Löf Type Theory, in particular a tool for equality reasoning supported by tools for deriving equality (and proofs or its properties) for inductive datatypes as well as automated proof-search.
متن کاملImplicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?
In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...
متن کاملThe effects of the violation of local independence assumption on the person measures under the Rasch model
Local independence of test items is an assumption in all Item Response Theory (IRT) models. That is, the items in a test should not be related to each other. Sharing a common passage, which is prevalent in reading comprehension tests, cloze tests and C-Tests, can be a potential source of local item dependence (LID). It is argued in the literature that LID results in biased parameter estimation ...
متن کاملMartin-löf Reducibility and Cost Functions
Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e. set of the same ML-degree. We investigate the interplay between ML-reducibility and cost functions, which are used to both measure the number of changes in a computable approximation, and the type of null sets used to cap...
متن کامل